Identifying codes in some subgraphs of the square lattice
نویسندگان
چکیده
منابع مشابه
Identifying codes in some subgraphs of the square lattice
An identifying code of a graph is a subset of vertices C such that the sets B(v) ∩ C are all nonempty and di,erent. In this paper, we investigate the problem of -nding identifying codes of minimum cardinality in strips and -nite grids. We -rst give exact values for the strips of height 1 and 2, then we give general bounds for strips and -nite grids. Finally, we give a sublinear algorithm which ...
متن کاملMinimum-Density Identifying Codes in Square Grids
An identifying code in a graph G is a subset of vertices with the property that for each vertex v ∈ V (G), the collection of elements of C at distance at most 1 from v is non-empty and distinct from the collection of any other vertex. We consider the minimum density d(Sk) of an identifying code in the square grid Sk of height k (i.e. with vertex set Z × {1, . . . , k}). Using the Discharging Me...
متن کاملOn Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals
ÐFault diagnosis of multiprocessor systems motivates the following graph-theoretic definition. A subset C of points in an undirected graph G V ;E is called an identifying code if the sets B v \ C consisting of all elements of C within distance one from the vertex v are different. We also require that the sets B v \ C are all nonempty. We take G to be the infinite square lattice with diago...
متن کاملThe study of electronic conductance of a nanoribbon with square lattice including some impurities
In this paper, we study the electronic conductance of a nanoribbon with square lattice by using Green’s function theory within the tight-binding approach. For this purpose, we separate the conductance modes in the ideal parts by using a suitable unitary transformation in order to obtain the analytic formula for the corresponding self-energies. Then, we present a fast computer algorithm based on...
متن کاملVertex identifying codes for the n-dimensional lattice
An r-identifying code on a graph G is a set C ⊂ V (G) such that for every vertex in V (G), the intersection of the radius-r closed neighborhood with C is nonempty and different. Here, we provide an overview on codes for the n-dimensional lattice, discussing the case of 1-identifying codes, constructing a sparse code for the 4-dimensional lattice as well as showing that for fixed n, the minimum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.007